package problem63_UniquePaths2;

public class MySolution {
	public int uniquePathsWithObstacles(int[][] obstacleGrid) {
		int m = obstacleGrid.length, n = obstacleGrid[0].length;
		int[][] dp = new int[m][n];
		dp[0][0] = obstacleGrid[0][0] == 0 ? 1 : 0;
		for (int i = 1; i < m; i++) {
			dp[i][0] = obstacleGrid[i][0]==1?0:dp[i - 1][0];
		}
		for (int j = 1; j < n; j++) {
			dp[0][j] =obstacleGrid[0][j]==1?0: dp[0][j - 1];
		}
		for (int i = 1; i < m; i++) {
			for (int j = 1; j < n; j++) {
				if (obstacleGrid[i][j] == 1)
					continue;
				dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
			}
		}
		return dp[m - 1][n - 1];
	}
	 
	 public static void main(String[] args){
		 System.out.println(new MySolution().uniquePathsWithObstacles(new int[][]{{0,0}}));
	 }
}
